Gradient bounds for Kolmogorov type diffusions
نویسندگان
چکیده
منابع مشابه
Lower Bounds Using Kolmogorov Complexity
In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functions, which gives the complexity of finding a bit where inputs differ, for pairs of inputs that map to different function values. This measure and variants thereof were shown to imply lower bounds for quantum and randomized decis...
متن کاملCircuit Lower Bounds à la Kolmogorov
In a recent paper, Razborov [Raz93] gave a new combinatorial proof of H astad's switching lemma [H as89], eliminating the probabilistic argument altogether. In this paper we adapt his proof and propose a Kolmogorov complexity-style switching lemma, from which we derive the probabilistic switching lemma as well as a Kolmogorov complexity-style proof of circuit lower bounds for parity. H astad's ...
متن کاملCircuit Complexity, Kolmogorov Complexity, and Prospects for Lower Bounds
This invited Descriptional Complexity of Formal Systems lecture provides an opportunity to raise awareness of the tight connection that exists between Kolmogorov Complexity and Circuit Complexity, and to argue that this connection is useful and interesting. Kolmogorov complexity has been used to provide examples of complete sets for classes such as EXP and PSPACE that are fundamentally differen...
متن کاملRefined Bounds on Kolmogorov Complexity for ω-Languages
The paper investigates bounds on various notions of complexity for ω–languages. We understand the complexity of an ω–languages as the complexity of the most complex strings contained in it. There have been shown bounds on simple and prefix complexity using fractal Hausdorff dimension. Here these bounds are refined by using general Hausdorff measure originally introduced by Felix Hausdorff. Furt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
سال: 2020
ISSN: 0246-0203
DOI: 10.1214/19-aihp975